A Near-Optimal Algorithm for Scheduling Soft-Aperiodic Requests in Dynamic Priority Systems
نویسندگان
چکیده
In this paper, we propose a reasonably simple and near-optimal soft aperiodic task scheduling algorithm in dynamic priority systems. The proposed algorithm has extended the EDF-CTI (Earliest Deadline First-Critical Task Indicating) Algorithm [4] in such a way of modifying the slack calculation method which in turns resolves the unit scheduling and the critical task misindicating problems. The paper demonstrates a simple way of slack calculation and near optimality of the algorithm. Our simulation study shows that the proposed algorithm, in most case, is slightly better than the EDF-CTI algorithm in terms of short response time of aperiodic requests, and considerably improves that in a high workload.
منابع مشابه
Scheduling of hard-aperiodic requests in dynamic priority systems
In this paper, we discuss the problem of jointly scheduling both hard deadline of periodic and aperiodic tasks in dynamic priority systems. The proposed scheduling scheme has extended the APS (Alternative Priority Scheduling) algorithm which is developed by the authors. The APS algorithm has a simple slcak calculation method which in consequence makes it be practical. The paper develops an effi...
متن کاملA Schedulable Utilization Bound for Aperiodic Tasks
In this paper, we derive a utilization bound on schedulability of apriodic tasks with arbitrary arrival times, execution times, and deadlines. To the author's knowledge, this is the rst time a utilization bound is derived for the aperiodic task model. It allows constructing an O(1) admission test for aperiodic tasks. Earlier admission tests are at best O(n). We show that deadline-monotonic sche...
متن کاملExtended Global Dual Priority Algorithm for Multiprocessor Scheduling in Hard Real-Time Systems
In this paper we present a global scheduling method for shared memory multiprocessor systems that provides a fixed-priority preemptive scheduling of periodic tasks, hard aperiodic tasks and soft aperiodic tasks on a set of identical processors. The method is based on the functioning of the Dual Priority Scheduling Algorithm extended to work in a multiprocessor environment. This algorithm guaran...
متن کاملAn optimal algorithm for scheduling soft-aperiodic tasks in fixed-priority preemptive systems
متن کامل
A Binary-Tree Architecture for Scheduling Real-Time Systems with Hard and Soft Tasks
Complex real-time systems require jointly schedule both periodic task and aperiodic tasks with hard and soft deadlines. This problem has been subject of considerably research in real-time systems and one of the most widely accepted solutions are dynamic slack stealing algorithms (DSS) for scheduling aperiodic tasks, running with earliest deadline first (EDF) algorithms for scheduling periodic o...
متن کامل